B and D Are Enough to Make the Halpern-Shoham Logic Undecidable
نویسندگان
چکیده
The Halpern Shoham logic is a modal logic of time intervals. Some e ort has been put in last ten years to classify fragments of this beautiful logic with respect to decidability of its satis ability problem. We contribute to this e ort by showing (among other results), that the BD fragment (where only the operators begins and during are allowed) is undecidable over discrete structures.
منابع مشابه
The Undecidability of the Logic of Subintervals
The Halpern–Shoham logic is a modal logic of time intervals. Some effort has been put in last ten years to classify fragments of this beautiful logic with respect to decidability of its satisfiability problem. We complete this classification by showing — what we believe is quite an unexpected result — that the logic of subintervals, the fragment of the Halpern–Shoham logic where only the operat...
متن کاملSearching for Well-Behaved Fragments of Halpern-Shoham Logic
Temporal reasoning constitutes one of the main topics within the field of Artificial Intelligence. Particularly interesting are interval-based methods, in which time intervals are treated as basic ontological objects, in opposite to point-based methods, where time-points are considered as basic. The former approach is more expressive and seems to be more appropriate for such applications as nat...
متن کاملThe Last Paper on the Halpern-Shoham Interval Temporal Logic
The Halpern–Shoham logic is a modal logic of time intervals. Some effort has been put in last ten years to classify fragments of this beautiful logic with respect to decidability of its satisfiability problem. We contribute to this effort by showing – what we believe is quite an unexpected result – that the logic of subintervals, the fragment of the Halpern–Shoham where only the operator “durin...
متن کاملDecidable and Undecidable Fragments of Halpern and Shoham's Interval Temporal Logic: Towards a Complete Classification
Interval temporal logics are based on temporal structures where time intervals, rather than time instants, are the primitive ontological entities. They employ modal operators corresponding to various relations between intervals, known as Allen’s relations. Technically, validity in interval temporal logics translates to dyadic second-order logic, thus explaining their complex computational behav...
متن کاملAn Epistemic Halpern-Shoham Logic
We define a family of epistemic extensions of Halpern–Shoham logic for reasoning about temporal-epistemic properties of multi-agent systems. We exemplify their use and study the complexity of their model checking problem. We show a range of results ranging from PTIME to PSPACE– hard depending on the logic considered.
متن کامل